<scp>Bilby</scp>-MCMC: an MCMC sampler for gravitational-wave inference

نویسندگان

چکیده

We introduce Bilby-MCMC, a Markov-Chain Monte-Carlo sampling algorithm tuned for the analysis of gravitational waves from merging compact objects. Bilby-MCMC provides parallel-tempered ensemble Metropolis-Hastings sampler with access to block-updating proposal library including problem-specific and machine learning proposals. demonstrate that proposals can produce over 10-fold improvement in efficiency by reducing autocorrelation time. Using variety standard tests, we validate ability independent posterior samples estimate Bayesian evidence. Compared widely-used dynesty nested algorithm, is less efficient producing accurate its estimation However, find drawn are more robust: never failing pass our validation tests. Meanwhile, fails difficult-to-sample Rosenbrock likelihood test, constraining posterior. For CBC problems, this highlights importance cross-sampler comparisons ensure results robust error. Finally, be embarrassingly asynchronously parallelised making it highly suitable wall-time using High Throughput Computing environment. may useful tool rapid gravitational-wave signals during advanced detector era expect have utility throughout astrophysics.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Mode-Hopping MCMC sampler

One of the main shortcomings of Markov chain Monte Carlo samplers is their inability to mix between modes of the target distribution. In this paper we show that advance knowledge of the location of these modes can be incorporated into the MCMC sampler by introducing mode-hopping moves that satisfy detailed balance. The proposed sampling algorithm explores local mode structure through local MCMC...

متن کامل

Parallelizing MCMC via Weierstrass Sampler

With the rapidly growing scales of statistical problems, subset based communicationfree parallel MCMC methods are a promising future for large scale Bayesian analysis. In this article, we propose a new Weierstrass sampler for parallel MCMC based on independent subsets. The new sampler approximates the full data posterior samples via combining the posterior draws from independent subset MCMC cha...

متن کامل

R2: An Efficient MCMC Sampler for Probabilistic Programs

We present a new Markov Chain Monte Carlo (MCMC) sampling algorithm for probabilistic programs. Our approach and tool, called R2, has the unique feature of employing program analysis in order to improve the efficiency of MCMC sampling. Given an input program P , R2 propagates observations in P backwards to obtain a semantically equivalent program P ′ in which every probabilistic assignment is i...

متن کامل

Lifted Probabilistic Inference: An MCMC Perspective

The general consensus seems to be that lifted inference is concerned with exploiting model symmetries and grouping indistinguishable objects at inference time. Since first-order probabilistic formalisms are essentially template languages providing a more compact representation of a corresponding ground model, lifted inference tends to work especially well in these models. We show that the notio...

متن کامل

Approximate Inference with Amortised MCMC

We propose a novel approximate inference framework that approximates a target distribution by amortising the dynamics of a user-selected Markov chain Monte Carlo (MCMC) sampler. The idea is to initialise MCMC using samples from an approximation network, apply the MCMC operator to improve these samples, and finally use the samples to update the approximation network thereby improving its quality...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Monthly Notices of the Royal Astronomical Society

سال: 2021

ISSN: ['0035-8711', '1365-8711', '1365-2966']

DOI: https://doi.org/10.1093/mnras/stab2236